The completeness of provable realizability.
نویسندگان
چکیده
منابع مشابه
Completeness and realizability: conditions for automatic generation of workflows
In recent years, workflow technology has greatly facilitated business process modeling and reengineering in information systems. On one hand, the separation of an application’s control structure from the implementation of its task programs simplifies and speeds up application development. On the other hand, the run-time system assists users in coordinating and scheduling tasks of a business pro...
متن کاملLinear realizability and full completeness for typed lambda-calculi
We present the model construction technique called Linear Realizability. It consists in building a category of Partial Equivalence Relations over a Linear Combinatory Algebra. We illustrate how it can be used to provide models, which are fully complete for various typed λ-calculi. In particular, we focus on special Linear Combinatory Algebras of partial involutions, and we present PER models ov...
متن کاملOn completeness and parametricity in the realizability semantics of System F
A general approach to the realizability semantics of System F is obtained by considering closure operators over sets of λ-terms. We investigate completeness and relational parametricity in the semantics generated by such closure operators. We prove general results and show that they can be applied to several well-known semantics, as those arising from Tait’s saturatedness conditions and from Gi...
متن کاملA revised completeness result for the simply typed λμ-calculus using realizability semantics
In this paper, we define a new realizability semantics for the simply typed λμ-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. We also prove a completeness result of our realizability semantics using a particular term model. This paper corrects some errors in [21] by the first author and Saber.
متن کاملLearning based realizability for HA + EM1 and 1-Backtracking games: Soundness and completeness
We prove a soundness and completeness result for Aschieri and Berardi’s learning based realizability for Heyting Arithmetic plus Excluded Middle over semi-decidable statements with respect to 1-Backtracking Coquand game semantics. First, we prove that learning based realizability is sound with respect to 1Backtracking Coquand game semantics. In particular, any realizer of an implication-and-neg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1989
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093635158